package dataStructure.recursive;

public class Migong {
    public static void main(String[] args) {
        int[][] map = new int[8][7];
        System.out.println(map.length);


        //加墙，默认1为墙，2为可走点，3为走不通的点

        //上下加墙
        for (int i = 0;i<7;i++){
            map[0][i]=1;
            map[7][i]=1;
        }
        //左右加
        for (int i = 0;i<8;i++){
          map[i][0]=1;
          map[i][6]=1;
        }
        //在加俩
        map[3][1]=1;
        map[3][2]=1;
        map[1][2]=1;
        map[2][2]=1;
        for (int i = 0; i <map.length ; i++) {
            for (int j = 0; j <map[0].length ; j++) {
                System.out.print(map[i][j]+" ");
            }
            System.out.println();
        }
        System.out.println("--------------------------------------");
        findWay(map,1,1);
        for (int i = 0; i <map.length ; i++) {
            for (int j = 0; j <map[0].length ; j++) {
                System.out.print(map[i][j]+" ");
            }
            System.out.println();
        }

    }
    //顺序：上、右、下、左
    public static boolean findWay(int[][]map,int i,int j ){
        if (map[6][5]==2){
            return true;
        }

        if (map[i][j]==0){
            map[i][j]=2;  //假设该位置是2
            if (findWay(map,i-1,j)){
                return true;
            }else if (findWay(map,i,j+1)){
                return true;
            }else if (findWay(map,i+1,j)){
                return true;
            }else if (findWay(map,i-1,j)){
                return true;
            }else {
                map[i][j]=3;
                return false;
            }
        }else {
            //  该点为 1,2,3 都不符合判断
            return false;
        }
    }
}
